A Decision Method for Parikh Slenderness of Context-free Languages
نویسنده
چکیده
In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given context-free language is Parikh slender.
منابع مشابه
On lengths of words in context-free languages
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for context-free languages and that the maximal number of words of the same length in a given context-free language is computable. Some e ective representations of slender context-free languages, as well as oth...
متن کاملOn Parikh slender context-free languages
In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science
متن کاملParikh's Theorem and Descriptional Complexity
This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...
متن کاملOn N-algebraic Parikh slender power series
In a recent paper we introduced Parikh slender languages and series as a generalization of slender languages de ned and studied by Andra siu, Dassow, P aun and Salomaa. Results concerning Parikh slender series can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given N-algebraic series is Parikh slender. Category: F...
متن کاملCharacterization of Context-Free Languages with Polynomially Bounded Ambiguity
We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections which deletes Parikh bounded symbols only. A symbol a is Parikh bounded in a language L if there is a constant c such that no word of L contains more than c occurrences of a. Furthermore PCFL is closed under the formally stron...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 73 شماره
صفحات -
تاریخ انتشار 1997